Boolean-type retractable state-finite automata without outputs
نویسندگان
چکیده
منابع مشابه
Boolean-type Retractable State-finite Automata Without Outputs
An automaton A is called a retractable automaton if, for every subau-tomaton B of A, there is at least one homomorphism of A onto B which leaves the elements of B fixed (such homomorphism is called a retract ho-momorphism of A onto B). We say that a retractable automaton A=(A,X,δ) is Boolean-type if there exists a family {λ B | B is a subautomaton of A} of retract homomorphisms λ B of A such th...
متن کاملRetractable state-finite automata without outputs
A homomorphism of an automaton A without outputs onto a subau-tomaton B of A is called a retract homomorphism if it leaves the elements of B fixed. An automaton A is called a retractable automaton if, for every subautomaton B of A, there is a retract homomorphism of A onto B. In [1] and [3], special retractable automata are examined. The purpose of this paper is to give a construction for state...
متن کاملFinite State Automata Synthesis in Boolean Network Robotics
We show that the automatic design of robot control systems based on Boolean networks can be exploited as a method of synthesis of Finite State Automata (FSA). To demonstrate our insight, we study a set of Boolean networks designed to let a robot perform two simple tasks. The networks are configured through a suitable optimization algorithm. We focus our analysis on the structure of the network ...
متن کاملResidual Finite State Automata
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...
متن کاملOn Algebraic Study of Type-2 Fuzzy Finite State Automata
Theories of fuzzy sets and type-2 fuzzy sets are powerful mathematical tools for modeling various types of uncertainty. In this paper we introduce the concept of type-2 fuzzy finite state automata and discuss the algebraic study of type-2 fuzzy finite state automata, i.e., to introduce the concept of homomorphisms between two type-2 fuzzy finite state automata, to associate a type-2 fuzzy trans...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publicationes Mathematicae Debrecen
سال: 2017
ISSN: 0033-3883
DOI: 10.5486/pmd.2017.7497